Prevalence, clinical presentation and complications of diabetes mellitus in obstetric patients attending a medical college hospital

Background: Diabetes mellitus (DM) may be present in the patient before the conception or it may appear during pregnancy. Obstetric management shall ensure prevention of diabetic embryopathy and early detection and management of diabetic complications in pregnancy.Methods: A descriptive observational study was undertaken on participants from a Medical College Hospital. The pre-existing medical disorders, blood sugar, routine antenatal investigations, type of delivery, ultrasound findings, complications of delivery, foetal outcome etc. were recorded. The participants were advised diet, exercise and pharmacotherapy. The intranatal and postnatal events were recorded. The results were compared with related literature.Results: The study had total 89 participants. Five participants (5.6%) had abnormal blood sugar values. Out of these, 2 participants were having pregestational DM and 3 were having gestational DM. Although all the participants who had abnormal blood sugar levels required caesarean section, two could not be operated. One participant with gestational DM who did not follow management advice delivered a macerated still born baby after shoulder dystocia. Another participant having gestational DM, who complied strictly as per dietary advice and exercise, could be managed well without insulin and delivered a healthy baby. The requirement of insulin increased in pregnancy in patients with pregestational diabetes.Conclusions: It is essential to ensure compliance on all three pillars of management of diabetes viz. diet, exercise and insulin during pregnancy. Hence health education for diabetes with special emphasis on obstetric care in pregnancy with diabetes should be promoted.

Study of gynecological health of women with disabilities

Background: In routine gynaecological practice, women with disabilities are rarely seen. The available literature regarding gynaecological and obstetric issues of women with disabilities is scanty. Hence this study was designed on women with disabilities participating.Methods: History and examination findings regarding gynaecological problems of 30 participants were collected.Results: Results show that two third of the participants had normal menses while others had dysmenorrhea, oligomenorrhea, premenstrual syndrome, menorrhagia, infective vaginitis and urinary tract infection. 11 participants were married, out of which 2 had infertility. None of the participants had clinical findings suggestive of breast or cervical cancer. These findings are compared with available studies of similar type.Conclusions: This study concludes recommending the need of special camps for women with disabilities with Gynaecologist on the panel

Study of the sexual and reproductive health of young women with visual impairment

Background: Census figures in 2011 have depicted that half of the visually impaired in India are women and a third of these females are in reproductive age group. This study was undertaken to identify the gynaecological health problems of the visually impaired young women and impart them necessary health education.Methods: All young visually impaired women attending composite regional centre for persons with disabilities, Bhopal during one day were offered consultation by gynecologist. Their needs and clinical findings were recorded.Results: There were 15 young women in the age range of 19 to 27 years participating in the study. This was their first ever visit to gynecologist. More than half of them reported that menstrual hygiene was taught to them by their mother, a third by peers, and one participant each reported that sister, aunt, and teacher helped them learn it. The cramping pain and warmth of discharge per vaginum helped them identify the onset of menses. Primary dysmenorrhea was the commonest complaint for which they relied on rest and over the counter available medicine.Conclusions: This study highlights the need of the inclusion of the visually impaired girls in adolescent reproductive and sexual health education with appropriate teaching learning material. Access to a gynecologist for the visually impaired shall be ensured through camps on regular basis and referral on individual need basis

Online Service with Delay

In this paper, we introduce the online service with delay problem. In this problem, there are $n$ points in a metric space that issue service requests over time, and a server that serves these requests. The goal is to minimize the sum of distance traveled by the server and the total delay in serving the requests. This problem models the fundamental tradeoff between batching requests to improve locality and reducing delay to improve response time, that has many applications in operations management, operating systems, logistics, supply chain management, and scheduling. Our main result is to show a poly-logarithmic competitive ratio for the online service with delay problem. This result is obtained by an algorithm that we call the preemptive service algorithm. The salient feature of this algorithm is a process called preemptive service, which uses a novel combination of (recursive) time forwarding and spatial exploration on a metric space. We hope this technique will be useful for related problems such as reordering buffer management, online TSP, vehicle routing, etc. We also generalize our results to $k > 1$ servers.Comment: 30 pages, 11 figures, Appeared in 49th ACM Symposium on Theory of Computing (STOC), 201

Near-Linear Time Edit Distance for Indel Channels

We consider the following model for sampling pairs of strings: s? is a uniformly random bitstring of length n, and s? is the bitstring arrived at by applying substitutions, insertions, and deletions to each bit of s? with some probability. We show that the edit distance between s? and s? can be computed in O(n ln n) time with high probability, as long as each bit of s? has a mutation applied to it with probability at most a small constant. The algorithm is simple and only uses the textbook dynamic programming algorithm as a primitive, first computing an approximate alignment between the two strings, and then running the dynamic programming algorithm restricted to entries close to the approximate alignment. The analysis of our algorithm provides theoretical justification for alignment heuristics used in practice such as BLAST, FASTA, and MAFFT, which also start by computing approximate alignments quickly and then find the best alignment near the approximate alignment. Our main technical contribution is a partitioning of alignments such that the number of the subsets in the partition is not too large and every alignment in one subset is worse than an alignment considered by our algorithm with high probability. Similar techniques may be of interest in the average-case analysis of other problems commonly solved via dynamic programming

Privately Answering Counting Queries with Generalized Gaussian Mechanisms

We give the first closed-form privacy guarantees for the Generalized Gaussian mechanism (the mechanism that adds noise x to a vector with probability proportional to exp(-(||x||_p/?)^p) for some ?, p), in the setting of answering k counting (i.e. sensitivity-1) queries about a database with (?, ?)-differential privacy (in particular, with low ?_?-error). Just using Generalized Gaussian noise, we obtain a mechanism such that if the true answers to the queries are the vector d, the mechanism outputs answers d? with the ?_?-error guarantee: ?[||d? - d||_?] = O(?{k log log k log(1/?)}/?). This matches the error bound of [Steinke and Ullman, 2017], but using a much simpler mechanism. By composing this mechanism with the sparse vector mechanism (generalizing a technique of [Steinke and Ullman, 2017]), we obtain a mechanism improving the ?{k log log k} dependence on k to ?{k log log log k}, Our main technical contribution is showing that certain powers of Generalized Gaussians, which follow a Generalized Gamma distribution, are sub-gamma. In subsequent work, the optimal ?_?-error bound of O(?{k log (1/?)}/?) has been achieved by [Yuval Dagan and Gil Kur, 2020] and [Badih Ghazi et al., 2020] independently. However, the Generalized Gaussian mechanism has some qualitative advantages over the mechanisms used in these papers which may make it of interest to both practitioners and theoreticians, both in the setting of answering counting queries and more generally

Superfluidity of Dirac Fermions in a Tunable Honeycomb Lattice: Cooper Pairing, Collective Modes, and Critical Currents

Motivated by recent experiments on atomic Dirac fermions in a tunable honeycomb optical lattice, we study the attractive Hubbard model of superfluidity in the anisotropic honeycomb lattice. At weak-coupling, we find that the maximum mean field pairing transition temperature, as a function of density and interaction strength, occurs for the case with isotropic hopping amplitudes. In this isotropic case, we go beyond mean field theory and study collective fluctuations, treating both pairing and density fluctuations for interaction strengths ranging from weak to strong coupling. We find evidence for a sharp sound mode, together with a well-defined Leggett mode over a wide region of the phase diagram. We also calculate the superfluid order parameter and collective modes in the presence of nonzero superfluid flow. The flow-induced softening of these collective modes leads to dynamical instabilities involving stripe-like density modulations as well as a Leggett-mode instability associated with the natural sublattice symmetry breaking charge-ordered state on the honeycomb lattice. The latter provides a non-trivial test for the experimental realization of the one-band Hubbard model. We delineate regimes of the phase diagram where the critical current is limited by depairing or by such collective instabilities, and discuss experimental implications of our results.Comment: 20 pages, 12 figures. v3: published versio